A New Modified Viterbo-boutros Sphere Decoding Algorithm
نویسندگان
چکیده
Abstract: In this paper, a new sphere decoding algorithm is introduced which is a modification of the Viterbo-Boutros (VB) algorithm. In the proposed algorithm, the problem of the initial selection of the search sphere radius in the VB algorithm has been removed, and furthermore, the speed of the algorithm is increased. To examine the performance of the proposed algorithm, we employ it in detection of signals in code division multiple access (CDMA) and multiple-input multiple-output (MIMO) systems. Computer simulations, by using the proposed algorithm, show a significant performance improvement with respect to other suboptimal detection methods.
منابع مشابه
On maximum-likelihood detection and the search for the closest lattice point
Maximum likelihood decoding algorithms for Gaussian MIMO linear channels are considered. Linearity over the field of real numbers facilitates the design of maximum likelihood decoders using number theoretic tools for searching the closest lattice point. These decoders are collectively referred to as sphere decoders in the literature. In this paper, a fresh look at this class of decoding algorit...
متن کاملGeometrical Detection Algorithm for MIMO Systems
The channel capacity and error-rate performance of MIMO systems could be improved by increasing the number of transmit antennas and receive antennas and the size of constellation used for modulation (Foschini and Gans, 1998). A main bottleneck that restricts the practical application of MIMO system is the unsatisfactory performance of the decoding algorithms, due to either high computational co...
متن کاملLattice Decoding for Joint
A new joint detection method based on sphere packing lattice decoding is presented. The algorithm is suitable for both synchronous and asynchronous multiple access CDMA-DSSS systems, and it may jointly detect up to 32 users with a reasonable complexity. The detection complexity is independent of the modulation size and large M-PAM or M-QAM constellations can be used. Further, a theoretical gain...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کامل